Abstract regular (tree) model checking

Abstract Regular Model Checking

Regular Model Checking Ahmed Bouajjani, Peter Habermehl, Tomas Vojnar To cite this version: Ahmed Bouajjani, Peter Habermehl, Tomas Vojnar. Abstract Regular Model Checking. Alur, Rajeev and Peled, Doron A. International Conference on Computer Aided Verification 2004, 2004, Boston, United States. Springer Verlag, pp.372-386, 2004, LNCS. HAL Id: hal-00159512 https://hal.archives-ou...

Regular Tree Model Checking

Abstract Regular Tree Model Checking of Complex Dynamic Data Structures

Regular Tree Model Checking of Complex Dynamic Data Structures Ahmed Bouajjani1, Peter Habermehl1, Adam Rogalewicz2, and Tomáš Vojnar2 1 LIAFA, University of Paris 7, Case 7014, 2 place Jussieu, F-75251 Paris 5, France. e-mail: {Ahmed.Bouajjani,Peter.Habermehl}@liafa.jussieu.fr 2 FIT, Brno University of Technology, Božetěchova 2, CZ-61266, Brno, Czech Republic. e-mail: {rogalew,vojnar}@fit.vutb...

INFINITY 2005 Preliminary Version Abstract Regular Tree Model Checking

Regular Tree Model Checking Ahmed Bouajjani, Peter Habermehl 1,2 LIAFA, University Paris 7, Case 7014, 2, place Jussieu, F-75251 Paris Cedex 05, France Adam Rogalewicz, Tomáš Vojnar 3,4 FIT, Brno University of Technology, Božetěchova 2, CZ-61266, Brno, Czech Republic

Towards Applying Mona in Abstract Regular Tree Model Checking

We consider the problem of automated formal verification of modern concurrent software systems. Dealing with such systems, which involves handling unbounded dynamic instantiation, recursion, etc., naturally leads to a need of dealing with infinite state spaces. We suppose states of such systems to be encoded terms with a tree structure and we would like to use the abstract regular tree model ch...